Search results for "model [interaction]"
showing 10 items of 1495 documents
Graph connectivity and monadic NP
2002
Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadi…
Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity
2016
Span program is a linear-algebraic model of computation which can be used to design quantum algorithms. For any Boolean function there exists a span program that leads to a quantum algorithm with optimal quantum query complexity. In general, finding such span programs is not an easy task. In this work, given a query access to the adjacency matrix of a simple graph G with n vertices, we provide two new span-program-based quantum algorithms:an algorithm for testing if the graph is bipartite that uses $$On\sqrt{n}$$ quantum queries;an algorithm for testing if the graph is connected that uses $$On\sqrt{n}$$ quantum queries.
Using Search Algorithms for Modeling Economic Processes
2013
Abstract Economic issues are placed in formal practice, when is desired a modelling of the economic process, a manufacturing process, a device, etc. Each share of that economic process is denoted by a, b, c, d, these actions with defined time periods and action pairs are formed strings of the form, ab * cab * bc ., ab, bb, bc. so for them there are no other restrictions. If the graph is viewed as a system image, nodes representing components, then an immediate interpretation of an arc (xi, xj) are the component xi that is said to directly influence component xj. If nodes have the significance of possible states of a system when a spring (xi.xj) means that, the system can jump from state xi …
Understanding Quantum Algorithms via Query Complexity
2017
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…
Single-valued extension property at the points of the approximate point spectrum
2003
Abstract A localized version of the single-valued extension property is studied at the points which are not limit points of the approximate point spectrum, as well as of the surjectivity spectrum. In particular, we shall characterize the single-valued extension property at a point λ o ∈ C in the case that λoI−T is of Kato type. From this characterizations we shall deduce several results on cluster points of some distinguished parts of the spectrum.
Decomposable Measures and Measures of Information for Crisp and Fuzzy Sets
1983
Abstract There exist bijections between the decomposable informations of Kampe de Feriet and Forte (1967a) and the decomposable measures of Weber (1982). Using integrals for Archimedean decomposable operations, introduced by Weber (1982), informations and measures of this type are extended from crisp to fuzzy sets. For ∨-decomposable measures, Sugeno’s (1974) integral is used. For ∧-decomposable informations, Nguyen’s (1977) construction and a modification are discussed.
Existence of fixed points for the sum of two operators
2010
The purpose of this paper is to study the existence of fixed points for the sum of two nonlinear operators in the framework of real Banach spaces. Later on, we give some examples of applications of this type of results (© 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Further generalization of fixed point theorems in Menger PM-spaces
2015
In this work, we establish some fixed point theorems by revisiting the notion of ψ-contractive mapping in Menger PM-spaces. One of our results (namely, Theorem 2.3) may be viewed as a possible answer to the problem of existence of a fixed point for generalized type contractive mappings in M-complete Menger PM-spaces under arbitrary t-norm. Some examples are furnished to demonstrate the validity of the obtained results.
Some Nonlinear Methods in Fréchet Operator Rings and Ψ*-Algebras
1995
Two different inverse function theorems, one of Nash-Moser type, the other due to H. Omori, are extended to obtain special surjectivity results in locally convex and locally pseudo-convex Frechet algebras generated by group actions and derivations. In particular, the following factorization problem is discussed. Let Ψ be a locally pseudo-convex Frechet algebra with unit e and T+ : Ψ Ψ a continuous linear operator. Does there exist a neighborhood U of 0 such that the equation where T- = IΨ- T, has a solution x ∈ Ψ for every y ∈ U?
A homotopy fixed point theorem in 0-complete partial metric space
2015
We generalize a result of Feng and Liu, on multi-valued contractive mappings, for studying the relationship between fixed point sets and homotopy fixed point sets. The presented results are discussed in the generalized setting of 0-complete partial metric spaces. An example and a nonlinear alternative of Leray-Schauder type are given to support our theorems.